QuadCover - Surface Parameterization using Branched Coverings

نویسندگان

  • Felix Kälberer
  • Matthias Nieser
  • Konrad Polthier
چکیده

We introduce an algorithm for the automatic computation of global parameterizations on arbitrary simplicial 2manifolds, whose parameter lines are guided by a given frame field, for example, by principal curvature frames. The parameter lines are globally continuous and allow a remeshing of the surface into quadrilaterals. The algorithm converts a given frame field into a single vector field on a branched covering of the 2-manifold and generates an integrable vector field by a Hodge decomposition on the covering space. Except for an optional smoothing and alignment of the initial frame field, the algorithm is fully automatic and generates high quality quadrilateral meshes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumerating branched orientable surface coverings over a non-orientable surface

The isomorphism classes of several types of graph coverings of a graph have been enumerated by many authors [M. Hofmeister, Graph covering projections arising from finite vector space over finite fields, Discrete Math. 143 (1995) 87–97; S. Hong, J.H. Kwak, J. Lee, Regular graph coverings whose covering transformation groups have the isomorphism extention property, Discrete Math. 148 (1996) 85–1...

متن کامل

Enumerating branched coverings over surfaces with boundaries

The number of nonisomorphic n-fold branched coverings over a given surface with a boundary is determined by the number of nonisomorphic n-fold graph coverings over a suitable bouquet of circles. A similar enumeration can be done for regular branched coverings. Some explicit formulae for enumerations are also obtained. © 2003 Elsevier Ltd. All rights reserved. MSC 2000: 05C10; 05C30; 57M12

متن کامل

Distributions of regular branched surface coverings

In a study of surface branched coverings, one can ask naturally: In how many different ways can a given surface be a branched covering of another given surface? This problem was studied by many authors in Quart. J. Math. Oxford Ser. 2 46 (1995) 485, Math. Scand. 84 (1999) 23, Discrete Math. 156 (1996) 141, Discrete Math. 183 (1998) 193, Discrete Math. (in press), European J. Combin. 22 (2001) 1...

متن کامل

Enumeration of the Branched Zp-Coverings of Closed Surfaces

A continuous function p : S̃ → S between two surfaces S̃ and S is called a branched covering if there exists a finite set B in S such that the restriction of p to S̃ − p−1(B), p | S̃−p−1(B) : S̃− p −1(B)→ S− B, is a covering projection in the usual sense. The smallest set B of S which has this property is called the branch set. A branched covering p : S̃ → S is regular if there exists a (finite) grou...

متن کامل

Stripe Parameterization of Tubular Surfaces

We present a novel algorithm for automatic parameterization of tubelike surfaces of arbitrary genus, such as the surfaces of knots, trees, blood vessels, neurons, or any tubular graph with a globally consistent stripe texture. Mathematically, these surfaces can be described as thickened graphs, and the calculated parameterization stripe will follow either around the tube, along the underlying g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2007